ALTO: an iterative area/performance tradeoff algorithm for LUT-based FPGA technology mapping
نویسندگان
چکیده
In this paper, we propose an iterative area/performance tradeoff algorithm for look-up table (LUT)-based field programmable gate array (FPGA) technology mapping. First, it finds an area-optimized, performance-considered initial network by a modified area optimization technique. Then, an iterative algorithm consisting of several resynthesizing techniques is applied to trade the area for the performance in the network gracefully. Experimental results show that this approach can efficiently provide a complete set of mapping solutions from the area-optimized one to the performance-optimized one for the given design. Furthermore, these two extreme solutions produced by our algorithm outperform the results provided by most existing algorithms. Therefore, our algorithm is very useful for the timing-driven, LUT-based FPGA synthesis.
منابع مشابه
FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs
This paper represents pioneering work in the area of technology mapping for FPGAs and presents a theoretical breakthrough by solving the LUT-‐based FPGA technology mapping problem for depth minimization optimally in polynomial time. The key idea was to model the LUT mapping problem as the computation of a minimum-‐height, K-‐feasible cut. This was the first global formulation of the LUT mapp...
متن کاملLUT-based FPGA technology mapping under arbitrary net-delay models
The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC designs. Most existing algorithms for performance-driven technology mapping for Lookup-table (LUT) based FPGA designs are based on the unit-delay model. In this paper we study the technology mapping problem under arbitrary net-delay models. We show that if the net delay can be determined or estimated before...
متن کاملAn Optimal Performance-driven Technology Mapping Algorithm for Lut-based Fpgas under Arbitrary Net-delay Models
The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC designs. Most existing performance-driven technology mapping algorithms for Lookup-table (LUT) based FPGA designs are based on unit delay model. In this paper we present an efficient algorithm which finds an optimal technology mapping solution with minimum delay under arbitrary net delay models for LUTbased...
متن کاملOn K-LUT Based FPGA Optimum Delay and Optimal Area Mapping
We developed, using structures from MV-SIS, an application dedicated to K-LUT based FPGA synthesis, named Xsynth. Main component of it, levelMap the mapping program, was implemented using the minDepth algorithm. The mapping program was instrumented in order to study and evaluate different heuristics involved in establishing best approach to find optimum delay and optimal area mapping. We did ru...
متن کاملA Power-aware Post-processing under depth constraint for LUT-based FPGA Technology Mapping
It is difficult for LUT-based FPGA technology mapping to generate a power-minimal K-input LUT network with minimum depth at one time because a problem for power-minimization was shown to be NP-hard[5]. A problem for area-minimization is also NP-hard, and area-aware algorithms[7][8][9][10] recover area after generating a depthminimum network. On the other hand, existing poweraware algorithms[11]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 8 شماره
صفحات -
تاریخ انتشار 2000